Worst case asymptotics of power-weighted Euclidean functionals
نویسندگان
چکیده
منابع مشابه
WF2Q: Worst-Case Fair Weighted Fair Queueing
The Generalized Processor Sharing (GPS) discipline is proven to have two desirable properties: (a) it can provide an end-to-end bounded-delay service to a session whose tra c is constrained by a leaky bucket; (b) it can ensure fair allocation of bandwidth among all backlogged sessions regardless of whether or not their tra c is constrained. The former property is the basis for supporting guaran...
متن کاملWORST CASE BOUNDS FOR THE EUCLIDEAN MATCHING PROBLEM-t
It is shown how the classical mathematical theory of sphere packing can be used to obtain bounds for a greedy heuristic for the bounded euclidean matching problem. In the case of 2 dimensions, bounds are obtained directly. For higher dimensions, an appeal is made to known bounds for the sphere packing problem that have appeared in the mathematical literature.
متن کاملWorst Case Complexity of Weighted Approximation and Integration over Rd
We study the worst case complexity of weighted approximation and integration for functions deened over R d. We assume that the functions have all partial derivatives of order up to r uniformly bounded in a weighted L p-norm for a given weight function. The integration and the error for approximation are deened in a weighted sense for another given weight %. We present a necessary and suucient c...
متن کامل2 Q : Worst-case Fair Weighted Fair Queueing
The Generalized Processor Sharing (GPS) discipline is proven to have two desirable properties: (a) it can provide an end-to-end bounded-delay service to a session whose tra c is constrained by a leaky bucket; (b) it can ensure fair allocation of bandwidth among all backlogged sessions regardless of whether or not their tra c is constrained. The former property is the basis for supporting guaran...
متن کاملWeighted Euclidean Biplots
We construct a weighted Euclidean distance that approximates any distance or dissimilarity measure between individuals that is based on a rectangular cases-by-variables data matrix. In contrast to regular multidimensional scaling methods for dissimilarity data, the method leads to biplots of individuals and variables while preserving all the good properties of dimension-reduction methods that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00437-x